NL-printable sets and nondeterministic Kolmogorov complexity
نویسنده
چکیده
P-printable sets were defined by Hartmanis and Yesha and have been investigated by several researchers. The analogous notion of Lprintable sets was defined by Fortnow et al; both P-printability and L-printability were shown to be related to notions of resource-bounded Kolmogorov complexity. NL-printability was defined by Jenner and Kirsig, but some basic questions regarding this notion were left open. In this paper we answer a question of Jenner and Kirsig by providing a machine-based characterization of the NL-printable sets. In order to relate NL-printability to resource-bounded Kolmogorov complexity, the paper introduces nondeterministic space-bounded Kolmogorov complexity. We present some of the basic properties of this notion of Kolmogorov complexity. Using similar techniques, we investigate relationships among classes between NL and UL.
منابع مشابه
Relativizations of the P-printable Sets and the Sets with Small Generalized Kolmogorov Complexity (revised) Relativizations of the P-printable Sets and the Sets with Small Generalized Kolmogorov Complexity (revised)
Although tally sets are generally considered to be weak when used as oracles, it is shown here that in relativizing certain complexity classes, they are in fact no less powerful than any other class of sets and are more powerful than the class of recursive sets. More speciically, relativizations of the classes of P-printable sets and sets with small Generalized Kolmogorov complexity (SGK) are s...
متن کاملL-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J. Comput., 17 (1988), pp. 1193–1202] on P-printable sets, we present some simple properties of the L-printable sets. This definition of “L-printable” is robust and allows us to give alternate characterizations of the ...
متن کاملCollapsing Degrees via Strong Computation
Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsenyi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open problem whether any collapses could be proven for sublinear nondeterministic space degrees. This paper provides the f...
متن کاملDerandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov complexity measures (KNt and KNT) and examine the properties of these measures using constructions of hitting set generators for nondeterministic circuits [22, 26]. We observe that KNt bears many similarities to the nondeter...
متن کاملLecture Notes on Evasiveness of Graph Properties
These notes cover the first eight lectures of the class Many Models of Complexity taught by László Lovász at Princeton University in the Fall of 1990. The first eight lectures were on evasiveness of graph properties and related topics; subsequent lectures were on communication complexity and Kolmogorov complexity and are covered in other sets of notes. The fundamental question considered in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 355 شماره
صفحات -
تاریخ انتشار 2003